Fundamentals of computation theory : 9th international conference, FCT '93, Szeged, Hungary, August 23-27, 1993 : proceedings
Bookreader Item Preview
Share or Embed This Item
texts
Fundamentals of computation theory : 9th international conference, FCT '93, Szeged, Hungary, August 23-27, 1993 : proceedings
- Publication date
- 1993
- Topics
- Electronic data processing -- Congresses, Informatique -- Congrès, Electronic data processing, Fundamentele informatica, Computers, Teoria Da Computacao, Informatique -- Congrès, Electronic Congresses
- Publisher
- Berlin ; New York : Springer-Verlag
- Collection
- inlibrary; printdisabled; internetarchivebooks
- Contributor
- Internet Archive
- Language
- English
- Title (alternate script)
- None
- Author (alternate script)
- None
ix, 471 pages : 24 cm
"This volume contains the proceedings of the Ninth Conference on Fundamentalsof Computation Theory (FCT 93) held in Szeged, Hungary, in August 1993. The conference was devoted to a broad range of topics including: - Semanticsand logical concepts in the theory of computing and formal specification - Automata and formal languages - Computational geometry, algorithmic aspects of algebra and algebraic geometry, cryptography - Complexity (sequential, parallel, distributed computing, structure, lower bounds, complexity of analytical problems, general concepts) - Algorithms (efficient, probabilistic, parallel, sequential, distributed) - Counting and combinatorics in connection with mathematical computer science The volume contains the texts of 8 invitedlectures and 32 short communications selected by the international program committee from a large number of submitted papers."--PUBLISHER'S WEBSITE
Includes bibliographical references
Rewriting, Mobius Functions and Semi-Commutations / V. Diekert -- Simulations between Different Models of Parallel Computers / M. Dietzfelbinger -- Dense and Disjunctive Properties of Languages / M. Ito -- The Hierarchy of Codes / H. Jurgensen and S. Konstantinidis -- Five Facets of Hyperedge Replacement Beyond Context-Freeness / H.-J. Kreowski -- An Action Structure for Synchronous [pi]-Calculus / R. Milner -- AC[superscript 0] Circuit Complexity. A Survey of Lower Bounds / R. Pudlak -- Pattern Languages: Problems of Decidability and Generation / A. Salomaa -- General Solution of Mirror Equation / H. Abdulrab and M. Maksimenko -- Decidability of Equivalence for Linear Letter to Letter Top-Down Tree Transducers / Y. Andre and F. Bossut -- Translations Between Flowchart Schemes and Process Graphs / J.A. Bergstra and Gh. Stefinescu -- Local Equational Logic / V.E. Cazanescu -- Liveness of Weighted Circuits and the Diophantine Problem of Frobenius / P. Chrzastowski-Wachtel and M. Raczunas -- Context-Free Graph Grammars: Separating Vertex Replacement from Hyperedge Replacement / B. Courcelle -- Formal Languages Consisting of Primitive Words / P. Domosi, S. Horvath, M. Ito, L. Kaszonyi and M. Katsura -- Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified Proof / B. Durand -- Efficient Interpretation of State Charts / J. Ebert -- Implementation of a Universal Unification Algorithm for Macro Tree Transducers / H. Fassbender -- Finding Maximum Convex Polygons / P. Fischer -- Approximations with Axis-Aligned Rectangles / P. Fischer, K.-U. Hoffgen, H. Lefmann and T. Luczak -- Vector Sequence Analysis and Full Weak Safety for Concurrent Systems / M. Girkar and R. Moll -- Does Transitivity Help? On the Complexity of Poset Properties / H.D. Groger -- Generalized Topological Sorting in Linear Time / T. Hagerup and M. Maas -- Easily Checked Self-Reducibility / L.A. Hemachandra and R. Silvestri -- On the Complexities of Linear LL(1) and LR(1) Grammars / M. Holzer and K.-J. Lange -- On the Relation Between Firing Sequences and Processes of Petri Nets / D.V. Hung and T.V. Dung -- Maximum Covering with D Cliques / K. Jansen, P. Scheffler and G. Woeginger -- Monotonically Labelled Ordered Trees and Multidimensional Binary Trees / R. Kemp -- Maximum Path Length Pumping Lemma for Edge-Replacement Languages / S. Kuske -- Regular Approximations to Shuffle Products of Context-Free Languages, and Convergence of their Generating Functions / R.S. Maier and R. Schott -- The Equational Theory of a Boolean Monad / E.G. Manes -- Non Erasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality / M. Margenstern -- On Scattered Syntactic Monoids / A. Mateescu -- Regular Tree Languages without Unary Symbols are Star-Free / A. Potthoff and W. Thomas -- One-Way Cellular Automata on Cayley Graphs / Z. Roka -- On Tree Pattern Unification Problems / P. Ruzicka and I. Privara -- Structural Equivalence and ETOL Grammars / K. Salomaa, D. Wood and S. Yu -- A Hierarchy of Deterministic Top-Down Tree Transformations / G. Slutzki and S. Vagvolgyi -- Synthesis of O(lg n) Testable Trees / H. Wu -- On the Learnability of a Restricted Predicate Formulae / J. Yin and Z. Hong
"This volume contains the proceedings of the Ninth Conference on Fundamentalsof Computation Theory (FCT 93) held in Szeged, Hungary, in August 1993. The conference was devoted to a broad range of topics including: - Semanticsand logical concepts in the theory of computing and formal specification - Automata and formal languages - Computational geometry, algorithmic aspects of algebra and algebraic geometry, cryptography - Complexity (sequential, parallel, distributed computing, structure, lower bounds, complexity of analytical problems, general concepts) - Algorithms (efficient, probabilistic, parallel, sequential, distributed) - Counting and combinatorics in connection with mathematical computer science The volume contains the texts of 8 invitedlectures and 32 short communications selected by the international program committee from a large number of submitted papers."--PUBLISHER'S WEBSITE
Includes bibliographical references
Rewriting, Mobius Functions and Semi-Commutations / V. Diekert -- Simulations between Different Models of Parallel Computers / M. Dietzfelbinger -- Dense and Disjunctive Properties of Languages / M. Ito -- The Hierarchy of Codes / H. Jurgensen and S. Konstantinidis -- Five Facets of Hyperedge Replacement Beyond Context-Freeness / H.-J. Kreowski -- An Action Structure for Synchronous [pi]-Calculus / R. Milner -- AC[superscript 0] Circuit Complexity. A Survey of Lower Bounds / R. Pudlak -- Pattern Languages: Problems of Decidability and Generation / A. Salomaa -- General Solution of Mirror Equation / H. Abdulrab and M. Maksimenko -- Decidability of Equivalence for Linear Letter to Letter Top-Down Tree Transducers / Y. Andre and F. Bossut -- Translations Between Flowchart Schemes and Process Graphs / J.A. Bergstra and Gh. Stefinescu -- Local Equational Logic / V.E. Cazanescu -- Liveness of Weighted Circuits and the Diophantine Problem of Frobenius / P. Chrzastowski-Wachtel and M. Raczunas -- Context-Free Graph Grammars: Separating Vertex Replacement from Hyperedge Replacement / B. Courcelle -- Formal Languages Consisting of Primitive Words / P. Domosi, S. Horvath, M. Ito, L. Kaszonyi and M. Katsura -- Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified Proof / B. Durand -- Efficient Interpretation of State Charts / J. Ebert -- Implementation of a Universal Unification Algorithm for Macro Tree Transducers / H. Fassbender -- Finding Maximum Convex Polygons / P. Fischer -- Approximations with Axis-Aligned Rectangles / P. Fischer, K.-U. Hoffgen, H. Lefmann and T. Luczak -- Vector Sequence Analysis and Full Weak Safety for Concurrent Systems / M. Girkar and R. Moll -- Does Transitivity Help? On the Complexity of Poset Properties / H.D. Groger -- Generalized Topological Sorting in Linear Time / T. Hagerup and M. Maas -- Easily Checked Self-Reducibility / L.A. Hemachandra and R. Silvestri -- On the Complexities of Linear LL(1) and LR(1) Grammars / M. Holzer and K.-J. Lange -- On the Relation Between Firing Sequences and Processes of Petri Nets / D.V. Hung and T.V. Dung -- Maximum Covering with D Cliques / K. Jansen, P. Scheffler and G. Woeginger -- Monotonically Labelled Ordered Trees and Multidimensional Binary Trees / R. Kemp -- Maximum Path Length Pumping Lemma for Edge-Replacement Languages / S. Kuske -- Regular Approximations to Shuffle Products of Context-Free Languages, and Convergence of their Generating Functions / R.S. Maier and R. Schott -- The Equational Theory of a Boolean Monad / E.G. Manes -- Non Erasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality / M. Margenstern -- On Scattered Syntactic Monoids / A. Mateescu -- Regular Tree Languages without Unary Symbols are Star-Free / A. Potthoff and W. Thomas -- One-Way Cellular Automata on Cayley Graphs / Z. Roka -- On Tree Pattern Unification Problems / P. Ruzicka and I. Privara -- Structural Equivalence and ETOL Grammars / K. Salomaa, D. Wood and S. Yu -- A Hierarchy of Deterministic Top-Down Tree Transformations / G. Slutzki and S. Vagvolgyi -- Synthesis of O(lg n) Testable Trees / H. Wu -- On the Learnability of a Restricted Predicate Formulae / J. Yin and Z. Hong
Notes
Text cut off in gutter.
- Access-restricted-item
- true
- Addeddate
- 2018-11-01 11:13:30
- Associated-names
- Ésik, Zoltán, 1951-
- Bookplateleaf
- 0004
- Boxid
- IA1398606
- Camera
- Sony Alpha-A6300 (Control)
- Collection_set
- china
- External-identifier
-
urn:lcp:fundamentalsofco0000fct9:lcpdf:54adbef8-574d-4970-93c9-96220e26692c
urn:lcp:fundamentalsofco0000fct9:epub:a1570b16-e87b-467e-b0b6-62b077e56723
- Foldoutcount
- 0
- Identifier
- fundamentalsofco0000fct9
- Identifier-ark
- ark:/13960/t2d86n92z
- Invoice
- 1213
- Isbn
-
3540571639
9783540571636
0387571639
9780387571638
- Lccn
- 93011816
- Ocr_converted
- abbyy-to-hocr 1.1.20
- Ocr_module_version
- 0.0.17
- Openlibrary_edition
- OL1403738M
- Openlibrary_work
- OL3914838W
- Page_number_confidence
- 96.31
- Pages
- 490
- Ppi
- 300
- Printer
- DYMO_LabelWriter_450_Turbo
- Republisher_date
- 20181103105303
- Republisher_operator
- associate-zhuoquanjie@archive.org
- Republisher_time
- 1231
- Scandate
- 20181101125501
- Scanner
- ttscribe4.hongkong.archive.org
- Scanningcenter
- hongkong
- Tts_version
- v1.61-final
- Worldcat (source edition)
- 28585594
- Full catalog record
- MARCXML
comment
Reviews
There are no reviews yet. Be the first one to
write a review.
60 Previews
2 Favorites
Purchase options
DOWNLOAD OPTIONS
No suitable files to display here.
EPUB and PDF access not available for this item.
Uploaded by ttscribe4.hongkong on